Pii: S0140-3664(98)00241-2
نویسندگان
چکیده
Electronic voting schemes can be divided into homomorphism encryption and anonymous channel based schemes. The former type requires massive communications and computation, thereby, inappropriate for large-scale voting. However, the soundness of the latter type heavily relies on the cooperation of the voters. Under these schemes, voting is disrupted if some voter abstains in the intermediate stages. In this article, we present a secure electronic voting scheme of the latter type. The proposed scheme is practical in that its assumptions are quite appropriate for realistic environments. More specifically, the soundness of the proposed scheme does not rely on the cooperation of the voters. q 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
Design of universal personal computing using SDL
Universal Personal Computing (UPC) is a novel concept to support nomadic computing on the Internet. UPC enables mobile users to access their personalized computing environment anywhere on the Internet using any available terminals. The system is modeled as distributed objects using CORBA to facilitate their distribution, interfacing, and integration. We have chosen SDL for our system design. Th...
متن کاملIPv6 over ATM flow-handling
This paper explores the ways to obtain high capacity allocation in the backbone network. IPv6 offers new possibilities for IP over ATM signalling.
متن کاملThe impact of routing on multicast error recovery
We investigate the relationship between multicast routing algorithms and reliable multicast communication. To capture the impact of the multicast tree topology onto reliable multicast, we consider two performance measures, namely the probability mass function of successful receptions and the expected number of retransmissions needed to successfully deliver a packet from the source to all receiv...
متن کاملA new distributed routing algorithm for supporting delay-sensitive applications
We propose a new distributed delay-constrained unicast routing algorithm which can always nd a delay-constrained path with small message complexity if such a path exists. At each network node, limited information about the network state is needed and only a small amount of computation is required. Simulation results show that the proposed algorithm has much better cost performance than the leas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999